0 v 1 1 9 N ov 1 99 7 Is Quantum Bit Commitment Really Impossible ?

نویسنده

  • András Bodor
چکیده

Recently it has been shown, that unconditionally secure quantum bit commitment schemes are in general impossible. I however argue if we allow that an honest Alice can fail with some small probability then secure protocols might exist. A scheme using quantum envelopes is proposed where the Mayers-Chau-Lo strategy fails.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ua nt - p h / 00 06 10 9 v 7 18 O ct 2 00 0 UNCONDITIONALLY SECURE QUANTUM BIT COMMITMENT IS POSSIBLE Horace

Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a ge...

متن کامل

ar X iv : h ep - t h / 93 11 06 9 v 1 1 1 N ov 1 99 3 QUANTUM GROUPS

These notes correspond rather accurately to the translation of the lectures given at the Fifth Mexican School of Particles and Fields, held in Guanajuato, Gto., in Decem-ber 1992. They constitute a brief and elementary introduction to quantum symmetries from a physical point of view, along the lines of the forthcoming book by C. Gómez, G. Sierra and myself.

متن کامل

ua nt - p h / 99 11 12 4 v 1 3 0 N ov 1 99 9 The query complexity of order - finding

We consider the problem where π is an unknown permutation on {0, 1, . . . , 2n− 1}, y0 ∈ {0, 1, . . . , 2n − 1}, and the goal is to determine the minimum r > 0 such that π (y0) = y0. Information about π is available only via queries that yield π x(y) from any x ∈ {0, 1, . . . , 2m − 1} and y ∈ {0, 1, . . . , 2n − 1} (where m is polynomial in n). The main resource under consideration is the numb...

متن کامل

ar X iv : h ep - p h / 97 10 23 0 v 2 1 9 N ov 1 99 7 KEK - TH - 546 Oct . ’ 97 Domain wall solution for vectorlike model

Domain wall solution for Nc = Nf supersymmetric QCD is constructed. Astrophysical implications of the domain wall configuration is also discussed. [email protected] 1

متن کامل

Quantum Bit Commitment from a Physical Assumption

Mayers and independently Lo and Chau have shown that unconditionally secure quantum bit commitment is impossible. In this paper we show that under the assumption that the sender is not able to perform generalized measurements involving more than n qubits coherently (n-coherent measurements) then quantum bit commitment is possible. A commitment scheme is δ-binding if for each execution there is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997